A Note on K-Best Solutions to the Chinese Postman Problem
نویسندگان
چکیده
The K-best problems on combinatorial optimization problems, in which K best solutions are considered instead of an optimal solution under the same conditions, have widely been studied. In this paper, we consider the K-best problem on the famous Chinese postman problem and develop an algorithm that nds K best solutions. The time complexity of our algorithm is O(S(n;m) + K(n + m + logK + nT (n +m;m))) where S(s; t) denotes the time complexity of an algorithm for ordinary Chinese postman problems and T (s; t) denotes the time complexity of a post optimal algorithm for non-bipartite matching problems de ned on a graph with s vertices and t edges.
منابع مشابه
Capacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm
This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical ...
متن کاملOn the mixed Chinese postman problem
The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. We give an integer linear programming formulation for this problem and then show that the extreme points of its linear relaxation polyhedron are all half-integral. keywords: Chinese postman problem, half-integrality, graph, flow
متن کاملHeuristics for the Weighted k-Chinese/rural Postman Problem with a Hint of Fixed Costs with Applications to Urban Snow Removal
We describe a weighted version of the k-Chinese or k-rural postman problem that occurs in the context of snow removal. The problem concerns the questions of which vehicle shall do each task and how the vehicles shall travel between tasks. We also consider different numbers of vehicles, in view of a fixed cost for each vehicle. We describe and discuss heuristic solution approaches, based on usab...
متن کاملThe Complexity of Arc Routing Problems
This chapter is devoted to surveying aspects of computational complexity for three central arc routing problems (and their corresponding variants): • Chinese Postman, where one asks for a minimum-cost tour traversing all edges of a graph at least once; • Rural Postman, which generalizes Chinese Postman in the sense that only a subset of the edges has to be visited; • Capacitated Arc Routing, re...
متن کاملOn games arising from multi-depot Chinese postman problems
This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a non-negative weight function on the edges of G. A solution to the MDCP is a minimum weight tour of the (di)graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal on Optimization
دوره 3 شماره
صفحات -
تاریخ انتشار 1993